Network flow problem - PDFSEARCH.IO - Document Search Engine

Network flow problem
Results: 219

#	Item
201	An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations Jonathan A. Kelner Add to Reading List Source URL: math.mit.edu Language: English - Date: 2013-04-08 19:53:37 Operations research Combinatorial optimization Maximum flow problem Gradient descent Flow network Graph Max-flow min-cut theorem Lipschitz continuity Function Mathematics Numerical analysis Network flow
202	On the Separation of Channel and Network Coding in Aref Networks Niranjan Ratnakar Add to Reading List Source URL: www.ifp.illinois.edu Language: English - Date: 2005-06-29 17:06:05 Discrete mathematics Coding theory Information theory Wireless sensor network Finite fields Network coding Maximum flow problem Flow network Max-flow min-cut theorem Mathematics Network flow Graph theory
203	IRE 1956 Add to Reading List Source URL: www.ece.rice.edu Language: English - Date: 2005-04-25 15:54:19 Combinatorial optimization Combinatorics Maximum flow problem Max-flow min-cut theorem Flow network Cut Connectivity Minimum cut Topology Graph theory Mathematics Network flow
204	A Simple Min-Cut Algorithm MECHTHILD STOER Televerkets Forskningsinstitutt, Kjeller, Norway Add to Reading List Source URL: www.cs.dartmouth.edu Language: English - Date: 2005-01-20 14:41:23 Graph connectivity Maximum flow problem Network flow Cut Max-flow min-cut theorem Minimum cut Connectivity NP-complete problems K-edge-connected graph Graph theory Mathematics Combinatorial optimization
205	Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems JACK EDMONDS Add to Reading List Source URL: www.akira.ruc.dk Language: English - Date: 2004-04-01 07:05:06 Theoretical computer science Flow network Ford–Fulkerson algorithm Maximum flow problem Push-relabel maximum flow algorithm Portable character set Network flow Mathematics Applied mathematics
206	Chapter 10: Network Flow Programming Linear programming, that amazingly useful technique, is about to resurface: many network problems are actually just special forms of linear programs! This includes, for example: Add to Reading List Source URL: www.sce.carleton.ca Language: English - Date: 2012-10-22 11:02:20 Flow network Maximum flow problem Transportation network Max-flow min-cut theorem Static single assignment form Circulation problem Shortest path problem Graph theory Network flow Mathematics
207	Non-linear Constraint Network Optimization for Efficient Map Learning Giorgio Grisetti∗ Add to Reading List Source URL: www.informatik.uni-freiburg.de Language: English - Date: 2009-12-02 05:34:42 Network flow Constraint programming Tree decomposition Shortest path tree Flow network Shortest path problem Kalman filter Decomposition method Capacitated minimum spanning tree Graph theory Mathematics Theoretical computer science
208	Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs Paul Christiano Add to Reading List Source URL: math.mit.edu Language: English - Date: 2010-10-19 15:39:13 Combinatorics Maximum flow problem Flow network Minimum cut Minimum-cost flow problem Cut Max-flow min-cut theorem Ford–Fulkerson algorithm Network flow Graph theory Mathematics
209	Arc-Flags in Dynamic Graphs⋆ Emanuele Berrettini1 , Gianlorenzo D’Angelo1 , and Daniel Delling2 1 Add to Reading List Source URL: i11www.iti.uni-karlsruhe.de Language: English - Date: 2009-08-27 08:25:24 Network theory Search algorithms Shortest path problem Network flow Routing algorithms Breadth-first search Graph Shortest path tree Flow network Mathematics Graph theory Theoretical computer science
210	PDF Document Add to Reading List Source URL: people.orie.cornell.edu Language: English - Date: 2012-08-01 14:25:14 Combinatorics Maximum flow problem Flow network Edmonds–Karp algorithm Ford–Fulkerson algorithm Network flow Graph theory Mathematics

UPDATE